A stochastic minimum principle

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A minimum principle for stochastic control problems with output feedback

A minimum principle for stochastic control problems with output feedback is derived by applying Bismut’s minimum principle for stochastic control problems with full information about the past to the Kushner-Stratonovitch equation describing the controlled evolution of the conditional density of the state. The well-known solution of the linear-quadratic Gaussian problem is obtained from the prin...

متن کامل

A stochastic minimum principle and an adaptive pathwise algorithm for stochastic optimal control

We present a numerical method for finite-horizon stochastic optimal control models. We derive a stochastic minimum principle (SMP) and then develop a numerical method based on the direct solution of the SMP. The method combines Monte Carlo pathwise simulation and non-parametric interpolation methods.Wepresent results froma standard linear quadratic controlmodel, and a realistic case study that ...

متن کامل

Minimum Description Length Principle

The minimum description length (MDL) principle states that one should prefer the model that yields the shortest description of the data when the complexity of the model itself is also accounted for. MDL provides a versatile approach to statistical modeling. It is applicable to model selection and regularization. Modern versions of MDL lead to robust methods that are well suited for choosing an ...

متن کامل

The Matrix Minimum Principle

The purpose of this paper is to provide an a]ternate statement of the Pontryagin maximum principle as applied to systems which are most conveniently and naturally described by matrix, rather than vector, differential or difference equations. The use of gradient matrices facilitates the manipulation of the resultant equations. The ~heory is applied to the solution of a simple optimization problem.

متن کامل

Minimum principle sufficiency

We characterize the property of obtaining a solution to a convex program by minimizing over the feasible region a linearization of the objective function at any of its solution points (Minimum Principle Sufficiency). For the case of a monotone linear complementarity problem this MPS property is completely equivalent to the existence of a nondegenerate solution to the problem. For the case of a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the American Mathematical Society

سال: 1976

ISSN: 0002-9904

DOI: 10.1090/s0002-9904-1976-14228-0